Sequential - System Factorization

نویسندگان

  • Kamlesh Rath
  • Steven D. Johnson
  • Christopher T. Haynes
  • David Winkel
چکیده

The success of high-level synthesis methods in reducing design time and formal veri cation methods in reducing design errors in digital VLSI circuits have opened the way to system-level synthesis and veri cation. Derivation is a form of formal veri cation that deals with correct-by-construction reasoning. A set of equivalence preserving transformations are used to derive an implementation from a speci cation. A key step in derivation is to impose an architectural structure on a behavioral speci cation by factoring functional behavior into abstract components [40]. These system factorization transformations impose a naive model for synchronization and data communication between components in a system. The thesis of this work is that system factorization must be generalized to support arbitrary interaction protocols between components in a system for derivational methodology to be useful in system-level design. This dissertation develops a general transformation to decompose a sequential system description into interacting sequential components with non-trivial interaction protocols. Behavior fragments from a system description are encapsulated into a sequential component. Sequential decomposition is used to construct an implementation of interacting sequential components from a higher level of speci cation, using a description of the interaction of a component with its environment as a parameter. Interface speci cation language (ISL) is introduced to describe the synchronous interaction of a machine with its environment. The complement of a machine speci ed in ISL describes the behavior of the machine's environment. Decomposition of sequential components is accomplished by encapsulating parts of a system at the algorithm, process or operation level of granularity into an abstract component with a speci-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving linear systems with vectorized WZ factorization

Abstract In the paper we present a vectorized algorithm for WZ factorization of a matrix which was implemented with the BLAS1 library. We present the results of numerical experiments which show that vectorization accelerates the sequential WZ factorization. Next, we parallelized both algorithms for a two-processor shared memory machine using the OpenMP standard. We present performances of these...

متن کامل

A new approach for building recommender system using non negative matrix factorization method

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

متن کامل

Adaptive Protection Based on Intelligent Distribution Networks with the Help of Network Factorization in the Presence of Distributed Generation Resources

Factorizing a system is one of the best ways to make a system intelligent. Factorizing the protection system, providing the right connecting agents, and transmitting the information faster and more reliably can improve the performance of a protection system and maintain system reliability against distributed generation resources. This study presents a new method for coordinating network protect...

متن کامل

A social recommender system based on matrix factorization considering dynamics of user preferences

With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...

متن کامل

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995